Reliable Resource Search in Scale Free Peer-to-Peer Network
نویسندگان
چکیده
The resource distribution and peer links in P2P network have an obvious scale free character follows power law distribution. Using this inherent character of P2P network to design resource search strategy is great significant for improving the search efficiency and reducing the costs. We analyze the scale free character in P2P network, and propose the reliable random walk search algorithm which can achieve high and reliable resource search through transferring query messages based on P2P power law distribution. We design simulation experiments to evaluate the performance of our reliable random walk. The simulation experimental results show that the reliable random walk based on power law distribution is a scalable resource search algorithm with high and reliable search efficiency and low search costs.
منابع مشابه
A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملBuilding Efficient Limited Scale-Free Overlay Topologies for Unstructured P2P Networks
In addition to the peer/data organization and search algorithm, the overlay network topology (logical connectivity graph) among peers is a crucial component in unstructured peer-to-peer (P2P) networks. Its topological characteristics significantly affect the efficiency of a search on such unstructured P2P networks. Scale-free (power-law) overlay network topologies are one type of the structures...
متن کاملDynamical Networks: Analysis of P2P Networks
Peer-To-Peer(P2P) networks are becoming ubiquitious.There are different kinds of P2P architectures and each of the architecture has its own merit and demerits. Peers interact and make decisions based on the local information. This local decisions have impact on the global behavior of the network. As a part of this project, first we model the dynamics involved in the network construction phase a...
متن کاملScale-Free Networks to Search in Unstructured Peer-To-Peer Networks
Unstructured peer-to-peer file sharing networks are very popular in the market. They introduce network traffic. The resultant networks are not perform search efficiently because existing overlay topology formation algorithms are creates unstructured P2P networks without performance guarantees. In this paper, We compares structured and unstructured overlays, Showing through analytical and simula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JNW
دوره 5 شماره
صفحات -
تاریخ انتشار 2010